package HighMethod09;

/**
 * B树的结构，偶数个节点，便于树的分裂；
 */
class BNode{
    static int m = 5;
    class KeyValue{
        char key;
        Object pval;
    }

    int n;  //元素的个数
    BNode pa;
    KeyValue []data = new KeyValue[m+1];    //k0 k1 k2 k3 k4 k5
    BNode []sub = new BNode[m+1];       //s0 s1 s2 s3 s4 s5
}

class BTree{
    BNode root;
    public BTree(){
        root = null;
    }
    public void insert_KV(){

    }
}

public class BTreeTest {



    public static void main(String[] args) {
        int x = 5/2;
        System.out.println(x);
    }
}
